Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое Combinators - определение
LOGICAL FORMALISM USING COMBINATORS INSTEAD OF VARIABLES
Combinator; Combinatorial logic (mathematics); Combinatory Logic; Abstraction elimination; K combinator; S combinator; Combinators; Combinatory algebra; S-combinator; Lambda elimination; Combinator calculus
Найдено результатов: 43
combinator
<theory> A function with no free variables. A term is
either a constant, a variable or of the form A B denoting the
application of term A (a function of one argument) to term
B. Juxtaposition associates to the left in the absence of
parentheses. All combinators can be defined from two basic
combinators - S and K. These two and a third, I, are defined
thus:
S f g x = f x (g x)
K x y = x
I x = x = S K K x
There is a simple translation between combinatory logic and
lambda-calculus. The size of equivalent expressions in the
two languages are of the same order.
Other combinators were added by David Turner in 1979 when he
used combinators to implement SASL:
B f g x = f (g x)
C f g x = f x g
S' c f g x = c (f x) (g x)
B* c f g x = c (f (g x))
C' c f g x = c (f x) g
See fixed point combinator, curried function,
supercombinators.
(2002-11-03)
Parser combinator
Parser combinators; Combinatory parsing; Parser Combinator; Combinator parser; Parser Combinators
In computer programming, a parser combinator is a higher-order function that accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some structure as output, typically a parse tree or a set of indices representing locations in the string where parsing stopped successfully.
combinatory logic
<logic> A system for reducing the operational notation of
logic, mathematics or a functional language to a sequence
of modifications to the input data structure. First
introduced in the 1920's by Schoenfinkel. Re-introduced
independently by Haskell Curry in the late 1920's (who
quickly learned of Schoenfinkel's work after he had the idea).
Curry is really responsible for most of the development, at
least up until work with Feys in 1958.
See combinator.
(1995-01-05)
Combinatory logic
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel Translated by Stefan Bauer-Mengelberg as "On the building blocks of mathematical logic" in Jean van Heijenoort, 1967.
combinatorial
BRANCH OF DISCRETE MATHEMATICS
CombinaTorics; Combinatorial; Combinatorial analysis; Combinatorial mathematics; Combinatoric; Combinatronic; Combinatorial theory; Combinational analysis; Calculate-opportunities
[?k?mb?n?'t?:r??l]
¦ adjective technical relating to combinations of items.
Derivatives
combinatorially adverb
Combinatorial proof
PROOFS IN ENUMERATIVE COMBINATORICS BASED ON BIJECTIONS OR DOUBLE COUNTINGS OF COMBINATORIAL OBJECTS
In mathematics, the term combinatorial proof is often used to mean either of two types of mathematical proof:
Interaction nets
Interaction net; Interaction combinators; Interaction calculus; Interaction system
Interaction nets are a graphical model of computation devised by Yves Lafont in 1990 as a generalisation of the proof structures of linear logic. An interaction net system is specified by a set of agent types and a set of interaction rules.
Combinatorial design
![The [[Fano plane]]](https://commons.wikimedia.org/wiki/Special:FilePath/Fano plane.svg?width=200 "The [[Fano plane]]")
SYMMETRIC ARRANGEMENT OF FINITE SETS
Combinatorial design theory; Balanced tournament design; Combinatorial Designs; Combinatorial designs; Combinatorial Design
Combinatorial design theory is the part of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. These concepts are not made precise so that a wide range of objects can be thought of as being under the same umbrella.
Combinatorial modelling
Combinatorial modelling is the process which lets us identify a suitable mathematical model to reformulate a problem. These combinatorial models will provide, through the combinatorics theory, the operations needed to solve the problem.
Combinatorial search
In computer science and artificial intelligence, combinatorial search studies search algorithms for solving instances of problems that are believed to be hard in general, by efficiently exploring the usually large solution space of these instances. Combinatorial search algorithms achieve this efficiency by reducing the effective size of the search space or employing heuristics.
Википедия
Combinatory logic
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell Curry, and has more recently been used in computer science as a theoretical model of computation and also as a basis for the design of functional programming languages. It is based on combinators, which were introduced by Schönfinkel in 1920 with the idea of providing an analogous way to build up functions—and to remove any mention of variables—particularly in predicate logic. A combinator is a higher-order function that uses only function application and earlier defined combinators to define a result from its arguments.
